K-class assignments

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Systematic Sorting: Teacher Characteristics and Class Assignments

Although prior research has documented differences in the distribution of teacher characteristics across schools serving different student populations, few studies have examined the extent to which teacher sorting occurs within schools. This study uses data from one large urban school district and compares the class assignments of teachers who teach in the same grade and in the same school in a...

متن کامل

Counting good truth assignments of random k-SAT formulae

We present a deterministic approximation algorithm to compute logarithm of the number of ‘good’ truth assignments for a random k-satisfiability (k-SAT) formula in polynomial time (by ‘good’ we mean that violate a small fraction of clauses). The relative error is bounded above by an arbitrarily small constant ǫ with high probability as long as the clause density (ratio of clauses to variables) α...

متن کامل

Intra-Class Competitive Assignments in CS2: A One-Year Study

The widespread goals of student retention, introducing larger programming projects, and fostering collaboration among students in computer science courses has led to the inclusion of group projects in many curricula, with task division and collaboration as motivation for students to complete assignments. This paper presents a study in a first-year programming assignment with similar goals, but ...

متن کامل

Prediction of recursive convex hull class assignments for protein residues

MOTIVATION We introduce a new method for designating the location of residues in folded protein structures based on the recursive convex hull (RCH) of a point set of atomic coordinates. The RCH can be calculated with an efficient and parameterless algorithm. RESULTS We show that residue RCH class contains information complementary to widely studied measures such as solvent accessibility (SA),...

متن کامل

Proper Learning of k-term DNF Formulas from Satisfying Assignments

In certain applications there may only be positive samples available to to learn concepts of a class of interest, and this has to be done properly, i. e. the hypothesis space has to coincide with the concept class, and without false positives, i. e. the hypothesis always has be a subset of the real concept (one-sided error). For the well studied class of k-term DNF formulas it has been known th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle

سال: 1972

ISSN: 0397-9350

DOI: 10.1051/ro/197206v300411